Multi-server, Finite Waiting Room, M / G / c / K Optimization Models

نویسنده

  • James MacGregor Smith
چکیده

Optimization models for multi-server queueing systems are very appropriate capacity planning and design tools for manufacturing, telecommunication, transportation, and facility modelling applications. A design methodology based on a two-moment approximation algorithm is utilized for optimizing the number of servers, arrival and service rates, and amount of waiting room in these M/G/c/K multi-server systems where service in the system is from a general distribution. A property describing the relationship between K and ρ bounds the region in which optimal results should be found for K. Extensive computational results are provided to evaluate the efficacy and usefulness of this optimization methodology on a number of different system problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

M M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)

Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...

متن کامل

Heavy-Traffic Limits for Loss Proportions in Single-Server Queues

We establish heavy-traffic stochastic-process limits for the queue-length and overflow stochastic processes in the standard single-server queue with finite waiting room (G/G/1/K). We show that, under regularity conditions, the content and overflow processes in related single-server models with finite waiting room, such as the finite dam, satisfy the same heavy-traffic stochastic-process limits....

متن کامل

Optimization of M G 1 Queue with Vacation (TECHNICAL NOTE)

This paper reports on the minimization of the average waiting time of the customers in the M/G/1 queue with vacation. Explicit formula for the unknown service parameter of a particular customer has been obtained by considering the exhaustive service discipline in the case of multi-user with unlimited service system. Moreover, results in case of partially gated and gated service disciplines unde...

متن کامل

Topological network design of general, finite, multi-server queueing networks

The topological network design of general service, finite waiting room, multi-server queueing networks is a complex optimization problem. Series, merge, and split topologies are examined using an approximation method to estimate the performance of these queueing networks and an iterative search methodology to find the optimal buffer allocation within the network. The coefficient of variation is...

متن کامل

A Approximations in Finite Capacity /? Multi-server Queues with Poisson Arrivals

In (his paper^-we^consider;an M/G/k queuelng model having finite capacity N . That Is, a model In which customers, arriving In accordance with a Polsson process having rate ■h > , enter the system If there are less than N others present when they arrive, and are then serviced by one of k servers, each of whom has service distribution G . Upon entering, a customer will either Immediately enter s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • INFOR

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2007